self-balancing potential

См. также в других словарях:

• Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… …   Wikipedia

• Standard Template Library — C++ Standard Library fstream iomanip ios iostream sstream string …   Wikipedia

• Commodity fetishism — Part of a series on Marxism …   Wikipedia

• Medical tourism — (also called medical travel, health tourism or global healthcare) is a term initially coined by travel agencies and the mass media to describe the rapidly growing practice of travelling across international borders to obtain health care. It also… …   Wikipedia

• Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

• Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… …   Wikipedia

• government budget — Forecast of governmental expenditures and revenues for the ensuing fiscal year. In modern industrial economies, the budget is the key instrument for the execution of government economic policies. Because government budgets may promote or retard… …   Universalium

• Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… …   Wikipedia

• Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… …   Wikipedia

• Inverted pendulum — An inverted pendulum is a pendulum which has its mass above its pivot point. It is often implemented with the pivot point mounted on a cart that can move horizontally and may be called a cart and pole. Whereas a normal pendulum is stable when… …   Wikipedia

• Dean Kamen — Kamen on one of his inventions, the Segway Born April 5, 1951 (1951 04 05) (age 60) Rockville Centre, New York Residence Westwind …   Wikipedia